P . Bouyer , F . Chevalier and N . Markey About the Expressiveness of TPTL and MTL Research Report LSV - 05 - 05 May 2005
نویسندگان
چکیده
TPTL and MTL are two classical timed extensions of LTL. In this paper, we answer a 15 year old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed in [AH90] for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.
منابع مشابه
On the Expressiveness of TPTL and MTL
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show that, surprisingly, the TPTL formula proposed in [4] for witnessing this conjecture can be expressed in MTL. More generally, we show that TPTL formulae using only the F modality can be translated into MTL.
متن کاملP . Bouyer , T . Brihaye and F . Chevalier Control in o - minimal hybrid systems Research Report LSV - 05 - 15 August 2005
In this paper, we consider the control of general hybrid systems. Surprisingly, time-abstract bisimulation is not fine enough for solving such a problem. Conversely, we show that suffix equivalence is a correct abstraction for that problem. We apply this equivalence to ominimal hybrid systems and get decidability and computability results in this framework.
متن کاملP . Bouyer , N . Markey and P . A . Reynier Robust Model - Checking of Timed Automata Research Report LSV - 05 - 08 June 2005
Recent works by Raskin et al. have brought out a model of parameterized timed automata which can be used for proving that timed systems are implementable. This is strongly connected to robustly verifying timed automata, i.e. verifying whether a property still holds even if the transitions may be slightly delayed or expedited. In those works, they have proved decidability of robust model-checkin...
متن کاملOn the Expressiveness of TPTL and MTL over ω-Data Words
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic data words over the natural numbers. We prove that, in this setting, TPTL is strictly more expressive than MTL. To this end, we introduce Ehrenfeucht-Fraı̈ssé...
متن کاملP . Bouyer , F . Cassez and F . Laroussinie Modal Logics for Timed Control Research Report LSV - 05 - 04 April 2005
In this paper we use the timed modal logic Lν to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a model-checking problem for an extension (L ν ) of the logic Lν with a new modality. More precisely we define a fragment of Lν , namely L det ν , such that any control objective of L ν can be translated into a L cont ν ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005